#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 100010;

int n;
int q[N];

void select_sort()
{
    for(int i = 0; i < n - 1; i ++)
    {
        int k = i;
        for(int  j = i + 1; j < n; j ++)
            if(q[j] <  q[k])
                k = j;
        swap(q[i], q[k]);
    }
}

int main()
{
    cin >> n;
    for (int i = 0; i < n; i ++ ) 
        cin >> q[i];
        
    select_sort();
    
    for (int i = 0; i < n; i ++ ) 
        cout << q[i] << ' ';
    
    return 0;
}
